A Representation of Local Time for Lipschitz Surfaces

Representation of Adsorption Data for the Case of Energetically Heterogeneous Solid Surfaces Using Artificial Neural Network

A Lipschitz Method for Accelerated

Interpolating discrete volume data into a continuous form adapts implicit surface techniques for rendering volumetric iso-surfaces. One such algorithm uses the Lipschitz condition to create an octree representation that accelerates volume rendering. Furthermore, only one preprocessing step is needed to create the Lipschitz-octree representation that accelerates rendering of iso-surfaces for any...

Non-Lipschitz Semi-Infinite Optimization Problems Involving Local Cone Approximation

In this paper we study the nonsmooth semi-infinite programming problem with inequality constraints. First, we consider the notions of local cone approximation $Lambda$ and $Lambda$-subdifferential. Then, we derive the Karush-Kuhn-Tucker optimality conditions under the Abadie and the Guignard constraint qualifications.

Local gradient pattern - A novel feature representation for facial expression recognition

Many researchers adopt Local Binary Pattern for pattern analysis. However, the long histogram created by Local Binary Pattern is not suitable for large-scale facial database. This paper presents a simple facial pattern descriptor for facial expression recognition. Local pattern is computed based on local gradient flow from one side to another side through the center pixel in a 3x3 pixels region...

Bernstein-type Techniques for 2d Free Boundary Graphs

that appears in many applications (see [AC], [F].) In [C1],[C2],[C3], the author introduced the notion of “viscosity” solution to (1.1), and developed the theory of existence and regularity of viscosity free boundaries. In particular, the regularity theory is inspired by the regularity theory for minimal surfaces, precisely by the “oscillation decay” method of De Giorgi, according to which if S...